Fast Universal Algorithms for Robustness Analysis
نویسندگان
چکیده
In this paper, we develop efficient randomized algorithms for estimating probabilistic robustness margin and constructing robustness degradation curve for uncertain dynamic systems. One remarkable feature of these algorithms is their universal applicability to robustness analysis problems with arbitrary robustness requirements and uncertainty bounding set. In contrast to existing probabilistic methods, our approach does not depend on the feasibility of computing deterministic robustness margin. We have developed efficient methods such as probabilistic comparison, probabilistic bisection and backward iteration to facilitate the computation. In particular, confidence interval for binomial random variables has been frequently used in the estimation of probabilistic robustness margin and in the accuracy evaluation of estimating robustness degradation function. Motivated by the importance of fast computing of binomial confidence interval in the context of probabilistic robustness analysis, we have derived an explicit formula for constructing the confidence interval of binomial parameter with guaranteed coverage probability. The formula overcomes the limitation of normal approximation which is asymptotic in nature and thus inevitably introduce unknown errors in applications. Moreover, the formula is extremely simple and very tight in comparison with classic Clopper-Pearson’s approach.
منابع مشابه
A Study on Robustness of Various Deformable Image Registration Algorithms on Image Reconstruction Using 4DCT Thoracic Images
Background: Medical image interpolation is recently introduced as a helpful tool to obtain further information via initial available images taken by tomography systems. To do this, deformable image registration algorithms are mainly utilized to perform image interpolation using tomography images.Materials and Methods: In this work, 4DCT thoracic images of five real patients provided by DI...
متن کاملFast Least Square Matching
Least square matching (LSM) is one of the most accurate image matching methods in photogrammetry and remote sensing. The main disadvantage of the LSM is its high computational complexity due to large size of observation equations. To address this problem, in this paper a novel method, called fast least square matching (FLSM) is being presented. The main idea of the proposed FLSM is decreasing t...
متن کاملHalf Beam Block Technique in Breast Cancer and It’s Dosimetric Analysis using different Algorithms
Introduction: Single isocentre half-beam block (HBB) technique permits the avoidance of hot and cold spots. This technique is very useful in sparing the underlying ipsilateral lung and heart, if the left breast is treated. The major advantage of this technique is that it facilitates the complete sparing of both contralateral breast and lung. Regarding this, the present study aimed to analyse th...
متن کاملRobustness-based portfolio optimization under epistemic uncertainty
In this paper, we propose formulations and algorithms for robust portfolio optimization under both aleatory uncertainty (i.e., natural variability) and epistemic uncertainty (i.e., imprecise probabilistic information) arising from interval data. Epistemic uncertainty is represented using two approaches: (1) moment bounding approach and (2) likelihood-based approach. This paper first proposes a ...
متن کاملA Thorough Comparative Analysis of PI and Sliding Mode Controllers in Permanent Magnet Synchronous Motor Drive Based on Optimization Algorithms
In this paper, the speed tracking for permanent magnet synchronous motor (PMSM) in field oriented control (FOC) method is investigated using linear proportional-integral (PI) controller, sliding mode controller (SMC) and its advanced counterparts. The advanced SMCs considered in this paper are fuzzy SMC (FSMC) and sliding mode controller with time-varying switching gain (SMC+TG) which can effec...
متن کامل